Regular Turán numbers of complete bipartite graphs
نویسندگان
چکیده
Let rex(n,F) denote the maximum number of edges in an n-vertex graph that is regular and does not contain F as a subgraph. We give lower bounds on rex(n,F), are best possible up to constant factor, when one C4, K2,t, K3,3 or Ks,t for t>s!.
منابع مشابه
Turán numbers of bipartite graphs plus an odd cycle
Article history: Received 12 October 2012 Available online 14 February 2014
متن کاملTurán Problems for Bipartite Graphs ∗
We consider an infinite version of the bipartite Turán problem. Let G be an infinite graph with V (G) = N, and let Gn be the n-vertex subgraph of G induced by the vertices {1, 2, . . . , n}. We show that if G is K2,t+1-free, then for infinitely many n, e(Gn) ≤ 0.471 √ tn3/2. Using the K2,t+1-free graphs constructed by Füredi, we construct an infinite K2,t+1-free graph with e(Gn) ≥ 0.23 √ tn3/2 ...
متن کاملSome Ramsey numbers for complete bipartite graphs
Upper bounds are determined for the Ramsey number ](m,n), 2 :; m n. These bounds are attained for infinitely many n in case of m 3 and are fairly close to the exact value for every m if n is sufficiently large.
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملRamsey Numbers of Some Bipartite Graphs Versus Complete Graphs
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Turán number ex(m, H) is the maximum number of edges in a graph of order m not containing a copy of H . We prove the following two results: (1) Let H be a graph obtained from a tree F of order t by adding a new vertex w and joining w to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2021.112531